Pauli graph and finite projective lines/geometries
نویسندگان
چکیده
The commutation relations between the generalized Pauli operators of N -qudits (i. e., N p-level quantum systems), and the structure of their maximal sets of commuting bases, follow a nice graph theoretical/geometrical pattern. One may identify vertices/points with the operators so that edges/lines join commuting pairs of them to form the so-called Pauli graph PpN . As per two-qubits (p = 2, N = 2) all basic properties and partitionings of this graph are embodied in the geometry of the symplectic generalized quadrangle of order two, W (2). The structure of the two-qutrit (p = 3, N = 2) graph is more involved; here it turns out more convenient to deal with its dual in order to see all the parallels with the two-qubit case and its surmised relation with the geometry of generalized quadrangle Q(4, 3), the dual of W (3). Finally, the generalized adjacency graph for multiple (N > 3) qubits/qutrits is shown to follow from symplectic polar spaces of order two/three. The relevance of these mathematical concepts to mutually unbiased bases and to quantum entanglement is also highlighted in some detail.
منابع مشابه
On the Pauli graphs of N-qudits
A comprehensive graph theoretical and finite geometrical study of the commutation relations between the generalized Pauli operators of N -qudits is performed in which vertices/points correspond to the operators and edges/lines join commuting pairs of them. As per two-qubits, all basic properties and partitionings of the corresponding Pauli graph are embodied in the geometry of the generalized q...
متن کاملOn the Pauli graphs on N-qudits
A comprehensive graph theoretical and finite geometrical study of the commutation relations between the generalized Pauli operators of N -qudits is performed in which vertices/points correspond to the operators and edges/lines join commuting pairs of them. As per two-qubits, all basic properties and partitionings of the corresponding Pauli graph are embodied in the geometry of the generalized q...
متن کاملConstructions of bipartite graphs from finite geometries
We construct an incidence structure using certain points and lines in finite projective spaces. The structural properties of the associated bipartite incidence graphs are analyzed. These n×n bipartite graphs provide constructions of C6-free graphs with Ω(n4/3) edges, C10-free graphs with Ω(n6/5) edges, and Θ(7, 7, 7)-free graphs with Ω(n8/7) edges. Each of these bounds is sharp in order of magn...
متن کاملQuantum contextual finite geometries from dessins d'enfants
We point out an explicit connection between graphs drawn on compact Riemann surfaces defined over the field Q̄ of algebraic numbers — so-called Grothendieck’s dessins d’enfants — and a wealth of distinguished point-line configurations. These include simplices, cross-polytopes, several notable projective configurations, a number of multipartite graphs and some ‘exotic’ geometries. Among them, rem...
متن کاملLow Density Parity Check Codes Based on Finite Geometries: A Rediscovery and New Results1
This paper presents a geometric approach to the construction of low density parity check (LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of Euclidean and projective geometries over finite fields. Codes of these four classes have good minimum distances and their Tanner graphs have girth 6. Finite geometry LDPC codes can be decoded in various ways, ranging f...
متن کامل